Bipolar fuzzy graphs based on boundary and interior vertices
نویسندگان
چکیده
منابع مشابه
Fuzzy Detour Boundary Vertices in Fuzzy Graphs
A vertex v in a connected fuzzy graph G is a fuzzy detour boundary vertex of a vertex u, if ) , ( ) , ( v u w u Δ ≤ Δ for every fuzzy detour neighbour w of v. This paper is devoted to see how the fuzzy detour boundary vertices are related to fuzzy detour interior vertices. Further, the relation between the fuzzy detour boundary vertices and fuzzy detour eccentric vertices are also studied. Some...
متن کاملGraphs with Four Boundary Vertices
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give a full description of all graphs that have exactly four boundary vertices, which answers a question of Hasegawa and Saito. To this end, we introduce the concept of frame of a graph. It allows us to construct, for every pos...
متن کاملNotes on "Bipolar fuzzy graphs"
In this note, we show by examples that Definitions 3.1, 5.6, and 5.7, Example 5.8, Propositions 5.9 and 5.10, and partial proof of Propositions 5.11 and 5.12 in a previous paper by Akram (Muhammad Akram, Bipolar fuzzy graphs, Inform. Sci. 181 (2011) 5548–5564) contain some flaws and then provide the correct versions. Finally, we introduce a generalized bipolar fuzzy graph. 2013 Elsevier Inc. Al...
متن کاملA NEW MULTIPLE CRITERIA DECISION-MAKING METHOD BASED ON BIPOLAR FUZZY SOFT GRAPHS
In this research study, we present a novel frame work for handling bipolar fuzzy soft information by combining bipolar fuzzy soft sets with graphs. We introduce several basic notions concerning bipolar fuzzy soft graphs and investigate some related properties. We also consider the application of the bipolar fuzzy soft graphs. In particular, three efficient algorithms are developed to solve mult...
متن کاملDirected graphs and its Boundary Vertices
Suppose that D = (V,E) is a strongly connected digraph. Let u, v ∈ V (D). The maximum distance md(u, v) is defined as md(u, v)=max{ −→ d (u, v), −→ d (v, u)} where −→ d (u, v) denote the length of a shortest directed u− v path in D. This is a metric. The boundary, contour, eccentric and peripheral sets of a strong digraph D are defined with respect to this metric. The main aim of this paper is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2020
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0s20/0096